Multiagent Chess Games
نویسنده
چکیده
A Multiagent Chess playing paradigm is defined. By defining spheres and strength degrees for pieces winning strategies on games can be defined. The new Intelligent Tree Computing theories we have defined since 1994 can be applied to present precise strategies and prove theorems on games. The multiagent chess game model is defined by an isomorphism on multiboards and agents. Intelligent game trees are presented and goal directed planning is defined by tree rewrite computation on intelligent game trees. Applying intelligent game trees we define capture agents and state an overview to multiagent chess thinking. Game tree intelligence degree is defined and applied to prove model-theoretic soundness and completeness. The game is viewed as a multiplayer game with only perfect information between agent pairs. The man-machine technologies thought dilemma is dispelled in brief by addressing the thinking in the absolute versus thinking for a precisely defined area with a multiagent image for the computing mind.
منابع مشابه
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers). A deterministic game has no chance element and in a perfect information game, all information is visible to all players. However, many real-world scenarios with competing agents are stochastic (non-deterministic) with...
متن کاملChess-like Games Are Dominance Solvable in at Most Two Steps
During the pioneering time of game-theoretic research in the first half of the past century, it was proved that the game of chess has a value, i.e., that either there is a winning strategy for White, or there is a winning strategy for Black, or both players can secure themselves a draw. Since then, a rich theory has developed for general games of perfect information,2 yet surprisingly little is...
متن کاملAn Ontology Design Pattern for Chess Games
We present an ontology pattern describing records of chess games. Besides being an interesting modeling problem by itself, the fact that chess is one of the most popular game in the world with hundreds of millions of active players, including several millions online players led to a huge amount of chess game data available from various online chess databases. Furthermore, these data are becomin...
متن کاملA New Chess Variant for Gaming AI
In this article, we explain a new chess variant that is more challenging for humans than the standard version of the game. A new rule states that either player has the right to switch sides if a ‘chain’ or link of pieces is created on the board. This appears to increase significantly the complexity of chess, as perceived by players, but not the actual size of its game tree. ‘Search’ therefore b...
متن کاملComputing the Aesthetics of Chess
Aesthetics in chess is a concept competent players are quite familiar with. For many, it is one of the main reasons they play. Much of the research with regard to chess however, has been towards making machines play better and to understand how humans think. This article explores the principles of chess aesthetics and proposes a computational model based on those principles. An experiment was c...
متن کامل